Forcing unbalanced complete bipartite minors
نویسندگان
چکیده
منابع مشابه
Forcing unbalanced complete bipartite minors
Myers conjectured that for every integer s there exists a positive constant C such that for all integers t every graph of average degree at least Ct contains a Ks,t minor. We prove the following stronger result: for every 0 < ε < 10−16 there exists a number t0 = t0(ε) such that for all integers t ≥ t0 and s ≤ εt/ log t every graph of average degree at least (1 + ε)t contains a Ks,t minor. The b...
متن کاملInterval minors of complete bipartite graphs
Interval minors of bipartite graphs were recently introduced by Jacob Fox in the study of Stanley-Wilf limits. We investigate the maximum number of edges in Kr,s-interval minor free bipartite graphs. We determine exact values when r = 2 and describe the extremal graphs. For r = 3, lower and upper bounds are given and the structure of K3,s-interval minor free graphs is studied.
متن کاملForcing large complete minors in infinite graphs
It is well-known that in finite graphs, large complete minors/topological minors can be forced by assuming a large average degree. Our aim is to extend this fact to infinite graphs. For this, we generalise the notion of the relative end degree, which had been previously introduced by the first author for locally finite graphs, and show that large minimum relative degree at the ends and large mi...
متن کاملLinear connectivity forces large complete bipartite minors
Let a be an integer. It is proved that for any s and k, there exists a constantN = N(s, k, a) such that every 31 2 (a+1)-connected graph with at least N vertices either contains a subdivision of Ka,sk or a minor isomorphic to s disjoint copies of Ka,k. In fact, we prove that connectivity 3a + 2 and minimum degree at least 31 2 (a + 1) − 3 are enough. The condition “a subdivision of Ka,sk” is ne...
متن کاملBipartite minors
We introduce a notion of bipartite minors and prove a bipartite analog of Wagner’s theorem: a bipartite graph is planar if and only if it does not contain K3,3 as a bipartite minor. Similarly, we provide a forbidden minor characterization for outerplanar graphs and forests. We then establish a recursive characterization of bipartite (2, 2)-Laman graphs — a certain family of graphs that contains...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2005
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2004.02.002